Detecting and enumerating small induced subgraphs in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e1894" altimg="si39.svg"><mml:mi>c</mml:mi></mml:math>-closed graphs
نویسندگان
چکیده
Fox et al. (2020) introduced a new parameter, called c -closure, for parameterized study of clique enumeration problems. A graph G is -closed if every pair vertices with at least common neighbors adjacent. The -closure the smallest such that -closed. We systematically explore impact on computational complexity detecting and enumerating small induced subgraphs. More precisely, each H three or four vertices, we investigate polynomial-time algorithms all occurrences in given graph.
منابع مشابه
Detecting induced subgraphs
An s-graph is a graph with two kinds of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into paths of arbitrary length (at least one). Given an s-graph B, we study the decision problem ΠB whose instance is a graph G and question is “Does G contain a realisation of B as an induced subgraph?”. For several B’s, th...
متن کاملGraphs Having Small Number of Sizes on Induced k-Subgraphs
Let ` be any positive integer, n be a sufficiently large number, and let G be a graph on n vertices. Define for any k νk(G) = |{|E(H)| : H is an induced subgraph of G on k vertices}|. We show that if 2` ≤ k ≤ n−2` and νk(G) ≤ ` then G has a complete or an empty subgraph on at least n − ` + 1 vertices, and a homogeneous set of order at least n − 2` + 2. These results are sharp.
متن کاملGraphs with a small number of distinct induced subgraphs
All graphs considered here are finite, simple and undirected. For a graph G, let i(G) denote the total number of isomorphism types of induced subgraphs of G. We call i(G) the &morphism number of G. Note that i(G) = i(c), where G is the complement of G, and that if G has 12 vertices then i(G) 2 II, as G contains an induced subgraph with m vertices for each m, 1 s m s n. An induced subgraph H of ...
متن کاملInduced Subgraphs of Johnson Graphs
The Johnson graph J(n, N) is defined as the graph whose vertices are the n-subsets of the set {1, 2, · · · , N}, where two vertices are adjacent if they share exactly n− 1 elements. Unlike Johnson graphs, induced subgraphs of Johnson graphs (JIS for short) do not seem to have been studied before. We give some necessary conditions and some sufficient conditions for a graph to be JIS, including: ...
متن کاملExcluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with chromatic number k + 1 almost all graphs not containing H as a subgraph are k-colorable if and only if H contains a color-critical edge. We strengthen the concept of H-free to induced subgraph containment, proving that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.06.019